Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions
نویسندگان
چکیده
We present combinatorial Gray codes and explicit designs of efficient algorithms for lexicographical combinatorial generation of the sets of nonnesting and sparse nonnesting set partitions of length n. AMS Subject Classification (2000): 05A18, 68R05, 68W99, 94B25.
منابع مشابه
Gray codes for noncrossing and nonnesting partitions of classical types
One of the fundamental topics on the area of combinatorial algorithms is the efficient generation of all objects in a specific combinatorial class in such a way that each item is generated exactly once, hence producing a listing of all objects in the considered class. A common approach to this problem has been the generation of the objects of a combinatorial class in such a way that two consecu...
متن کاملOn Noncrossing and Nonnesting Partitions of Type D Alessandro Conflitti and Ricardo Mamede
We present an explicit bijection between noncrossing and nonnesting partitions of Coxeter systems of type D which preserves openers, closers and transients. 1. Overview The lattice of set partitions of a set of n elements can be interpreted as the intersection lattice for the hyperplane arragement corresponding to a root system of type An−1, i.e. the symmetric group of n objects, Sn. In particu...
متن کاملOn Noncrossing and Nonnesting Partitions for Classical Reflection Groups
The number of noncrossing partitions of {1, 2, . . . , n} with fixed block sizes has a simple closed form, given by Kreweras, and coincides with the corresponding number for nonnesting partitions. We show that a similar statement is true for the analogues of such partitions for root systems B and C, defined recently by Reiner in the noncrossing case and Postnikov in the nonnesting case. Some of...
متن کاملA bijection between noncrossing and nonnesting partitions for classical reflection groups
We present an elementary type preserving bijection between noncrossing and nonnesting partitions for all classical reflection groups, answering a question of Athanasiadis.
متن کاملA bijection between noncrossing and nonnesting partitions of types A, B and C
The total number of noncrossing partitions of type Ψ is equal to the nth Catalan number 1 n+1 ( 2n n ) when Ψ = An−1, and to the corresponding binomial coefficient ( 2n n ) when Ψ = Bn or Cn. These numbers coincide with the corresponding number of nonnesting partitions. For type A, there are several bijective proofs of this equality; in particular, the intuitive map, which locally converts each...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 592 شماره
صفحات -
تاریخ انتشار 2015